The Volume of the Giant Component of a Random Graph with Given Expected Degrees
نویسندگان
چکیده
منابع مشابه
The Volume of the Giant Component of a Random Graph with Given Expected Degrees
We consider the random graph model G(w) for a given expected degree sequence w = (w1, w2, . . . , wn). If the expected average degree is strictly greater than 1, then almost surely the giant component in G of G(w) has volume (i.e., sum of weights of vertices in the giant component) equal to λ0Vol(G) +O( √ n log n), where λ0 is the unique nonzero root of the equation n ∑ i=1 wie −wiλ = (1− λ) n ∑
متن کاملthe pathology of historical texts translation: a study of persian translations of 7th volume of cambridge history of iran
ترجمه با گسترش زبان آغاز شده و اهمیت آن روز به روز افزایش می یابد، و برای اولین بار به عنوان شاخه ای از دانش و روشی برای انتقال علوم، فرهنگ و تجربه در در دوره قاجار در ایران آغاز شد. در حقیقت متون تاریخی از اولین متونی هستند که در ایران ترجمه شدند چرا که به سیاستمداران آن دوره کمک می کردند تا به علل موفقیت جهان غرب و پیشرفت هایشان در طول تاریخ پی ببرند، بنابراین به تدریج ترجمه این گونه متون رون...
15 صفحه اولThe Spectra of Random Graphs with Given Expected Degrees
In the study of the spectra of power law graphs, there are basically two competing approaches. One is to prove analogues of Wigner’s semi-circle law while the other predicts that the eigenvalues follow a power law distributions. Although the semi-circle law and the power law have nothing in common, we will show that both approaches are essentially correct if one considers the appropriate matric...
متن کاملThe Spectral Gap of Random Graphs with Given Expected Degrees
We investigate the Laplacian eigenvalues of a random graphG(n,d) with a given expected degree distribution d. The main result is that w.h.p. G(n,d) has a large subgraph core(G(n,d)) such that the spectral gap of the normalized Laplacian of core(G(n,d)) is ≥ 1− c0d̄ min with high probability; here c0 > 0 is a constant, and d̄min signifies the minimum expected degree. The result in particular appli...
متن کاملThe Size of the Giant Component of a Random Graph with a Given Degree Sequence
Given a sequence of non negative real numbers which sum to we consider a random graph having approximately in ver tices of degree i In the authors essentially show that if P i i i then the graph a s has a giant component while if P i i i then a s all components in the graph are small In this paper we analyze the size of the giant component in the former case and the structure of the graph forme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2006
ISSN: 0895-4801,1095-7146
DOI: 10.1137/050630106